|
課程名稱 |
演算法
Algorithms |
|
開課學期 |
108-1 |
|
授課對象 |
電機工程學系 |
|
授課教師 |
張耀文 |
|
課號 |
EE4033 |
|
課程識別碼 |
901 39000 |
|
班次 |
01 |
|
學分 |
3.0 |
|
全/半年 |
半年 |
|
必/選修 |
必修 |
|
上課時間 |
星期二3,4(10:20~12:10)星期三7(14:20~15:10) |
|
上課地點 |
博理112博理112 |
|
備註 |
週二第2節要上課。本系優先。
總人數上限：70人 |
|
Ceiba 課程網頁 |
http://ceiba.ntu.edu.tw/1081EE4033_01 |
|
課程簡介影片 |
|
|
核心能力關聯 |
核心能力與課程規劃關聯圖 |
|
課程大綱
|
|
為確保您我的權利,請尊重智慧財產權及不得非法影印
|
|
課程概述 |
Course Contents: Topics include
• Algorithmic fundamentals: mathematical foundations, growth of functions, recurrences (6 hrs)
• Sorting and order statistics (6 hrs)
• Data structures: heap, binary search trees, RB trees, disjoint sets (4 hrs)
• Advanced design and analysis techniques: dynamic programming, greedy algorithms, amortized analysis
(9 hrs)
• Graph algorithms: graph representations, searching, minimum spanning trees, shortest paths, network
flow, matching (14 hrs)
• Computational complexity, NP-completeness, and approximation algorithms (6 hrs)
• General-purpose algorithms: simulated annealing and machine learning, as time permits. |
|
課程目標 |
Course Objective: Focuses on the design and analysis of algorithms and their applications, and develops problem-solving techniques. |
|
課程要求 |
Prerequisites: data structures (or discrete mathematics). |
|
預期每週課後學習時數 |
|
|
Office Hours |
每週三 17:00~18:00 |
|
指定閱讀 |
Required Text: T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 3rd
Ed., MIT Press/McGraw Hill, 2009. ISBN: 978-0-262-53305-8. |
|
參考書目 |
NIL |
|
評量方式
(僅供參考) |
|
No. |
項目 |
百分比 |
說明 |
|
1. |
Three mini programming assignments |
20% |
(all submissions will be subject to duplication checking; those with 40% similarity will be penalized |
2. |
Midterm (20%) + Final Exam (30%) |
50% |
|
3. |
Six homework assignment |
30% |
+ in-class quizzes on the due dates |
|
|
週次 |
日期 |
單元主題 |
|
第1週 |
9/10,9/11 |
ATTENTION: Class begins at 9:20am and runs three hours on Tuesdays! |
|